Producing Skolem Expansion Trees with the CERESω method: A Case Study Martin Riener, joint work with Alexander Leitsch

Source URL: www.logic.at

• Mathematical logic
• Logic
• Mathematics
• Model theory
• Proof theory
• Quantification
• Predicate logic
• Thoralf Skolem
• Skolem normal form
• Soundness
• Quantifier
• Sequent calculus

MD5 considered harmful today Creating a rogue CA certificate December 30, 2008 Alexander Sotirov, Marc Stevens, Jacob Appelbaum, Arjen Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger

Source URL: infoscience.epfl.ch

• Cryptography
• Public-key cryptography
• Cryptographic hash functions
• Key management
• Cryptographic protocols
• Public key infrastructure
• MD5
• X.509
• Public key fingerprint
• Collision resistance
• MerkleDamgrd construction
• SHA-2

Searching large hypothesis spaces by asking questions Alexander N. Cohen () Brenden M. Lake () Hunter College High School

Source URL: cims.nyu.edu

• Probability and statistics
• Statistics
• Statistical theory
• Bayesian network
• Bayesian inference
• Statistical hypothesis testing
• Twenty Questions
• Bayesian programming

Smart Contracts for Bribing Miners Patrick McCorry, Alexander Hicks, and Sarah Meiklejohn University College London {p.mccorry,alexander.hicks.16,s.meiklejohn}@ucl.ac.uk Abstract. We present three smart contracts that a

Source URL: smeiklej.com

• Cryptocurrencies
• Bitcoin
• Blockchains
• Economy
• Money
• Computing
• Alternative currencies
• Digital currencies
• Ethereum
• Fork
• Mining pool
• Smart contract

Species of Science Studies by Paul Alexander Armstrong

Source URL: tspace.library.utoronto.ca

• Science
• Historiography of science
• Philosophy of science
• Science studies
• Science and technology studies
• Bibliometrics
• Sociology
• Scientometrics
• Scientific method
• Citation analysis
• Sociocultural evolution
• Strong programme

System Feature Description: Importing Refutations into the GAPT Framework Cvetan Dunchev Alexander Leitsch Tomer Libal

Source URL: www.logic.at

• Automated theorem proving
• Theoretical computer science
• Mathematical logic
• Mathematics
• Proof theory
• Logic in computer science
• Prover9
• Resolution
• Proof compression
• Automated reasoning
• Natural deduction
• Mathematical proof

Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very

Source URL: mirror.clarkson.edu

• Computer programming
• Recursion
• Mathematical logic
• Software engineering
• Computability theory
• Theory of computation
• Theoretical computer science
• -recursive function
• Recursive definition
• Well-founded relation
• Functional programming
• Pattern matching

Synthesis and verification of self-aware systems Radu Calinescu, Marco Autili, Javier C´amara, Antinisca Di Marco, Simos Gerasimou, Paola Inverardi, Alexander Perucci, Nils Jansen, Joost-Pieter Katoen, Marta Kwiatkowska

Source URL: qav.comlab.ox.ac.uk

• Computing
• Electronic engineering
• Theoretical computer science
• Electronic design automation
• Service choreography
• Formal verification
• Orchestration
• Autonomic computing
• Transition
• Business Process Execution Language
• High-level synthesis
• Systems engineering

Pushing to the Top with K-induction Arie Gurfinkel Electrical and Computer Engineering University of Waterloo joint work with Alexander Ivrii (IBM)

Source URL: arieg.bitbucket.io

Defining Recursive Functions in Isabelle/HOL Alexander Krauss Abstract This tutorial describes the use of the function package, which provides general recursive function definitions for Isabelle/HOL. We start with very

Source URL: isabelle.in.tum.de

• Computer programming
• Recursion
• Mathematical logic
• Software engineering
• Computability theory
• Theory of computation
• Theoretical computer science
• -recursive function
• Recursive definition
• Well-founded relation
• Functional programming
• Pattern matching